全文获取类型
收费全文 | 485篇 |
免费 | 32篇 |
国内免费 | 28篇 |
专业分类
化学 | 21篇 |
力学 | 40篇 |
综合类 | 13篇 |
数学 | 413篇 |
物理学 | 58篇 |
出版年
2023年 | 4篇 |
2022年 | 4篇 |
2021年 | 4篇 |
2020年 | 6篇 |
2019年 | 12篇 |
2018年 | 8篇 |
2017年 | 14篇 |
2016年 | 15篇 |
2015年 | 13篇 |
2014年 | 16篇 |
2013年 | 28篇 |
2012年 | 29篇 |
2011年 | 21篇 |
2010年 | 15篇 |
2009年 | 18篇 |
2008年 | 29篇 |
2007年 | 23篇 |
2006年 | 28篇 |
2005年 | 24篇 |
2004年 | 38篇 |
2003年 | 16篇 |
2002年 | 19篇 |
2001年 | 14篇 |
2000年 | 22篇 |
1999年 | 14篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1996年 | 20篇 |
1995年 | 8篇 |
1994年 | 10篇 |
1993年 | 14篇 |
1992年 | 14篇 |
1991年 | 9篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1979年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有545条查询结果,搜索用时 15 毫秒
1.
求解一类非单调线性互补问题的宽邻域内点方法及其计算复杂性 总被引:1,自引:0,他引:1
对于一类非单调线性互补问题给出了一种新的算法——宽邻域内点算法,并讨论了其计算复杂性。 相似文献
2.
Katsunari Inoue Kazuaki Kato Norimitsu Tohnai Mikiji Miyata 《Journal of polymer science. Part A, Polymer chemistry》2004,42(18):4648-4655
We studied simulations by computer graphics to estimate the steric mechanism of the asymmetric polymerization of prochiral diene monomers in channels of inclusion compounds of steroidal bile acids, such as deoxycholic acid (DCA) and cholic acid. We applied a hierarchization method to interpret the crystal structures of bile acids, clarifying that the chiral host molecules associated to form characteristic 21-helical assemblies with uneven surfaces. A detailed analysis of the uneven channels in a close-packing state indicated that there were many possible arrangements of the monomers in the channels. The plausible arrangements in the channel could explain a previous study, which showed that the polymerization in the DCA channel yielded chiral polymers with a predominant configuration from prochiral diene monomers, such as 2-methyl-trans-1,3-pentadiene. On the basis of such simulation studies of the arrangements of guest monomers in the channel, we examined a plausible steric mechanism for asymmetric inclusion polymerization. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 4648–4655, 2004 相似文献
3.
In this paper, an interior point cutting plane method (IPCPM)is applied to solve optimal power flow (OPF) problems. Comparedwith the simplex cutting plane method (SCPM), the IPCPM is simpler,and efficient because of its polynomial-time characteristic.Issues in implementing IPCPM for OPF problems are addressed,including (1) how to generate cutting planes without using thesimplex tableau, (2) how to identify the basis variables inIPCPM, and (3) how to generate mixed integer cutting planes.The calculation speed of the proposed algorithm is further enhancedby utilizing the sparsity features of the OPF formulation. Numericalsimulations on IEEE 14-300-bus test systems have shown thatthe proposed method is effective. 相似文献
4.
A BRANCH BOUND METHOD FOR SUBSET SUM PROBLEM 总被引:1,自引:0,他引:1
吴士泉 《应用数学学报(英文版)》1994,10(3):302-314
ABRANCHBOUNDMETHODFORSUBSETSUMPROBLEMWUSHIQUAN(吴士泉)(InstituteofAppliedMathematics,theChineseAcademyofSciences,Beijing100080,C... 相似文献
5.
Antonio Jimé nez-Melado Claudio H. Morales 《Proceedings of the American Mathematical Society》2006,134(2):501-507
We show a fixed point theorem for condensing mappings under a new condition of the Leray-Schauder type. We call it the Interior Condition. We also discuss examples that demonstrate the independence of these two conditions.
6.
对于线性型多目标半定规划问题,引进加权中心路径的概念,并利用单目标半定规划的中心路径法,提出了求解多目标半定规划问题的加权中心路径法,先得型对一个叔向量的有效解,然后在此基础上,提出了通过一次迭代得到对应一定范围内其他任意权向量的有效解的一步修正方法. 相似文献
7.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献
8.
框式约束凸二次规划问题的内点算法 总被引:4,自引:0,他引:4
张艺 《高等学校计算数学学报》2002,24(2):163-168
In this paper,a primal-dual interior point algorithm for convex quadratic progromming problem with box constrains is presented.It can be started at any primal-dual interior feasible point.If the initial point is close to the central path,it becomes a central path-following alogorithm and requires a total of O(√nL)number of iterations,where L is the input length. 相似文献
9.
The nature of a very high-dimensional chaotic attractor in an infinite-dimensional phase space is examined for the purpose of studying the relationships between the physical processes occurring in the real space and the characteristics of high-dimensional attractor in the phase space. We introduce two complementary bases from which the attractor is observed, one the Lyapunov basis composed of the Lyapunov vectors and the another the Fourier basis composed of the Fourier modes. We introduce the exterior subspaces on the basis of the Lyapunov vectors and observe the chaotic motion projected onto these exteriors. It is shown that a certain statistical property of the projected motion changes markedly as the exterior subspace goes out of the attractor. The origin of such a phenomenon is attributed to more fundamental features of our attractor, which become manifest when the attractor is observed from the Lyapunov basis. A counterpart of the phenomenon can be observed also on the Fourier basis because there is a statistical one-to-one correspondence between the Lyapunov vectors and the Fourier modes. In particular, a statistical property of the high-pass filtered time series reflects clearly the difference between the interior and the exterior of the attractor. 相似文献
10.
本文利用多边形网格上的间断有限元方法离散二阶椭圆方程,在曲边区域上,采用多条直短边逼近曲边的以直代曲的策略,实现了高阶元在能量范数下的最优收敛.本文还将这一方法用于带曲边界面问题的求解,同样得到高阶元的最优收敛.此外我们还设计并分析了这一方法的\linebreakW-cycle和Variable V-cycle多重网格预条件方法,证明当光滑次数足够多时,多重网格预条件算法一致收敛.最后给出了数值算例,证实该算法的可行性并验证了理论分析的结果. 相似文献